Metalevel algorithms for variant satisfiability
نویسندگان
چکیده
Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra TΣ{E when the theory pΣ,Eq has the finite variant property and its constructors satisfy a compactness condition. This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents a reflective implementation in Maude 2.7.1 of variant satisfiability checking using these sub-algorithms.
منابع مشابه
Exact Algorithms for Variants of Satisfiability and Colouring Problems
This dissertation studies exact algorithms for various hard problems and give an overview of not only results but also the techniques used. In the first part we focus on Satisfiability and several variants of Satisfiability. We present some historical techniques and results. Our main focus in the first part is on a particular variant of Satisfiability, Exact Satisfiability. Exact Satisfiability...
متن کاملVariant-based satisfiability in initial algebras
Although different satisfiability decision procedures can be combined by algorithms such as those of Nelson-Oppen or Shostak, current tools typically can only support a finite number of theories to use in such combinations. To make SMT solving more widely applicable one needs theory-generic satisfiability algorithms allowing a potentially infinite number of decidable theories to be user-definab...
متن کاملEnhanced ACS algorithms for plastic analysis of planar frames
In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...
متن کاملEnhanced Walk-SAT with Finite Learning Automata For MAX-SAT
Researchers in artificial intelligence usually adopt the constraint satisfaction problem and the Satisfiability paradigms as their preferred methods when solving various real worlds decision making problems. Local search algorithms used to tackle different optimization problems that arise in various fields aim at finding a tactical interplay between diversification and intensification to overco...
متن کاملExact Algorithms for Exact Satisfiability Problems
This thesis presents exact means for solving a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (Xsat) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. While developing exact algorithms to solve the problems, we gain new insights into their structure and mutual similarities and differences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016